The maximum flow problem with fuzzy constraints 帶模糊約束的最大流問題
Maximum flow problem 最大流量問題
This subject will survey some of the applications of network flows and focus on key special cases of network flow problems including the following : the shortest path problem , the maximum flow problem , the minimum cost flow problem , and the multi - commodity flow problem 這個(gè)主題將審視一些網(wǎng)流的應(yīng)用并集中焦點(diǎn)在以下網(wǎng)流問題的關(guān)鍵特殊情況:最短路徑問題,最大流量問題,最少成本流量問題,和多元物品流量問題。
百科解釋
In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum.